On structural parameterizations of firefighting
نویسندگان
چکیده
منابع مشابه
On Structural Parameterizations of Firefighting
The Firefighting problem is defined as follows. At time t = 0, a fire breaks out at a vertex of a graph. At each time step t > 0, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all undefended neighbors from the vertices on fire. This process stops when the fire cannot spread anymore. The goal is to find a sequence of vertices for the firefighter tha...
متن کاملOn Structural Parameterizations of the Edge Disjoint Paths Problem
In this paper we revisit the classical Edge Disjoint Paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P . Our focus lies on structural parameterizations for the problem that allow for efficient (polynomial-time or fpt) algorithms. As our first result, we...
متن کاملOn Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
TheOdd Cycle Transversal problem (oct) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of oct with respect to their polynomial kernelizability, i.e., whether instances can be efficiently reduced to a size polynomial in the chosen parameter. It is a major open problem in parameterized complexity whether Od...
متن کاملKernel Bounds for Structural Parameterizations of Pathwidth
Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graphG has pathwidth at most k admits no polynomial kernelization with respect to k. The present work studies the existence of polynomial kernels for Pathwidth with respect to other, structural, parameters. Our main result is that, unless NP ⊆ coNP/poly, Pathwidth admits no polynomial kernelization ev...
متن کاملStructural Parameterizations of Feedback Vertex Set
A feedback vertex set in an undirected graph is a subset of vertices whose removal results in an acyclic graph. It is well-known that the problem of finding a minimum sized (or k-sized in case of decision version of) feedback vertex set (FVS) is polynomial time solvable in (sub)-cubic graphs, in pseudo-forests (graphs where each component has at most one cycle) and mock-forests (graphs where ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.02.032